Path-Directed Abstraction and Refinement for SAT-Based Design Debugging

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SAT based Abstraction Refinement for Hardware Verification

Model checking is a widely used automatic formal verification technique. Despite the recent advances in model checking technology, its application is still limited by the state explosion problem. For model checking large real world systems, abstraction is essential. This thesis investigates abstraction techniques for the efficient verification of hardware designs with thousands of registers. A ...

متن کامل

SAT-based Abstraction Refinement for (Timed) Constraint Automata

Failures within embedded systems of automotive industry, railway technology, and avionics usually have disastrous consequences. Dominant features of such safetycritical systems are that safety not only depends on the values of variables communicated between components, but also on (inter-component) actions and reactions that arrive in time. For instance, a train controller needs to apply the br...

متن کامل

SAT-based Abstraction Refinement for Real-time Systems

In this paper, we present an abstraction refinement approach for model checking safety properties of realtime systems using SAT-solving. We present a faithful embedding of bounded model checking for systems of timed automata into propositional logic with linear arithmetic and prove correctness. With this logical representation, we achieve a linear-size representation of parallel composition and...

متن کامل

SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation

We present a SAT-based algorithm for assisting users of Symbolic Trajectory Evaluation (STE) in manual abstraction refinement. We demonstrate the usefulness of the algorithm on a larger case study (the verification of a CAM).

متن کامل

Diploma thesis SAT-based Verification for Abstraction Refinement

The aim of this diploma thesis is to verify reachability properties of timed automata using SAT-based verification methods, while mainly eliminating the state explosion problem using abstraction refinement techniques. Especially for complex and safety critical systems, reachability analysis plays a major role, thus, verification shall be restricted to the system parts essential to the property....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

سال: 2013

ISSN: 0278-0070,1937-4151

DOI: 10.1109/tcad.2013.2263036